Enumerating nested and consecutive partitions

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enumerating Consecutive and Nested Partitions for Graphs

Consecutive and nested partitions have been extensively studied in the set-partition problem as tools with which to search efficiently for an optimal partition. We extend the study of consecutive and nested partitions on a set of integers to the vertex-set of a graph. A subset of vertices is considered consecutive if the subgraph induced by the subset is connected. In this sense the partition p...

متن کامل

Optimality of consecutive and nested tree partitions

We consider the problem of partitioning the vertex-set of a tree to p parts to minimize a cost function. Since the number of partitions is exponential in the number of vertices, it is helpful to identify small classes of partitions which also contain optimal partitions. Two such classes, called consecutive partitions and nested partitions, have been well studied for the set partition problem, w...

متن کامل

Nested Partitions Using Texture Segmentation

A multi-step method of partitioning the pixels of an image such that the partitions at one step are wholly nested inside the partitions of the next step is described, i.e. we describe an agglomerative, hierarchical segmentation technique that uses texture information to perform the segmentation. The image is requantized using K-Means clustering. Then, clusters are expanded using region growing ...

متن کامل

Enumerating finite set partitions according to the number of connectors

Let P (n, k) denote the set of partitions of [n] = {1, 2, . . . , n} containing exactly k blocks. Given a partition Π = B1/B2/ · · · /Bk ∈ P (n, k) in which the blocks are listed in increasing order of their least elements, let π = π1π2 · · · πn denote the canonical sequential form wherein j ∈ Bπj for all j ∈ [n]. In this paper, we supply an explicit formula for the generating function which co...

متن کامل

Nested chain partitions of LYM posets

A long-standing conjecture states that all LYM posets possess nested chain partitions. We verify this conjecture for posets of rank 2. © 2004 Elsevier B.V. All rights reserved.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 1995

ISSN: 0097-3165

DOI: 10.1016/0097-3165(95)90097-7